Transitive sets and cyclic quadrilaterals
نویسندگان
چکیده
منابع مشابه
Convex Quadrilaterals and k-Sets
We prove that the minimum number of convex quadrilaterals determined by n points in general position in the plane – or in other words, the rectilinear crossing number of the complete graph Kn – is at least ( 38 + 10 −5) ( n 4 ) +O(n). Our main tool is a lower bound on the number of (≤ k)-sets of the point set: we show that for every k ≤ n/2, there are at least 3 ( k+1 2 ) subsets of size at mos...
متن کاملOn transitive soft sets over semihypergroups
The aim of this paper is to initiate and investigate new soft sets over semihypergroups, named special soft sets and transitive soft sets and denoted by $S_{H}$ and $T_{H},$ respectively. It is shown that $T_{H}=S_{H}$ if and only if $beta=beta^{*}.$ We also introduce the derived semihypergroup from a special soft set and study some properties of this class of semihypergroups.
متن کاملSharply $(n-2)$-transitive Sets of Permutations
Let $S_n$ be the symmetric group on the set $[n]={1, 2, ldots, n}$. For $gin S_n$ let $fix(g)$ denote the number of fixed points of $g$. A subset $S$ of $S_n$ is called $t$-emph{transitive} if for any two $t$-tuples $(x_1,x_2,ldots,x_t)$ and $(y_1,y_2,ldots ,y_t)$ of distinct elements of $[n]$, there exists $gin S$ such that $x_{i}^g=y_{i}$ for any $1leq ileq t$ and additionally $S$ is called e...
متن کاملCovering the Convex Quadrilaterals of Point Sets
For a point set P on the plane, a four element subset S ⊂ P is called a 4-hole of P if the convex hull of S is a quadrilateral and contains no point of P in its interior. Let R be a point set on the plane. We say that a point set B covers all the 4-holes of R if any 4-hole of R contains an element of B in its interior. We show that if |R| ≥ 2|B|+5 then B cannot cover all the 4-holes of R. A sim...
متن کامل1-transitive Cyclic Orderings
We give a classification of all the countable 1-transitive cyclic orderings, being those on which the automorphism group acts singly transitively. We also classify all the countable 1-transitive coloured cyclic orderings, where these are countable cyclic orderings in which each point is assigned a member of a set C, thought of as its ‘colour’, and by ‘1transitivity’ we now mean that the automor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorics
سال: 2011
ISSN: 2156-3527,2150-959X
DOI: 10.4310/joc.2011.v2.n3.a6